Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
نویسندگان
چکیده
In studying effective structures we investigate the effective content of typical notions and constructions in many branches of mathematics including universal algebra and model theory. In particular, we are interested in the possibilities of effectivizing model–theoretic or algebraic constructions and the limits on these possibilities. For instance, we try to understand whether certain results of model theory (or universal algebra) can be carried out effectively. If not, we then try to discover sharp effective counterexamples. The systematic study of effectiveness in algebraic structures goes back to pioneering papers by Frölich and Shepherdson [11], Malcev [31][32], and Rabin [37] in the early 60s. Later in the early 70s, Nerode and his collaborators initiated combining algebraic constructions with priority arguments from computability theory thus beginning a new era in the development of the subject. Nowadays, there various approaches to effectiveness in structures. For example, Cenzer, Nerode, Remmel have been developing theory of p-time
منابع مشابه
Π1 Classes and Strong Degree Spectra of Relations
We study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear order. Countable Π1 subsets of 2 ω and Kolmogorov complexity play a major role in the proof.
متن کاملΠ10 classes and strong degree spectra of relations
We study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear order. Countable Π1 subsets of 2 ω and Kolmogorov complexity play a major role in the proof.
متن کاملCategoricity Spectra for Rigid Structures
For a computable structure M , the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M . If the spectrum has a least degree, this degree is called the degree of categoricity of M . In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures wi...
متن کاملTuring Degrees of Certain Isomorphic Images of Computable Relations
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the domain of A. That is, R is not named in the language of A. We define DgA(R) to be the set of Turing degrees of the images f(R) under all isomorphisms f from A to computable models. We investigate conditions on A and R...
متن کاملDegree Spectra of Unary Relations on 〈ω,≤〉
A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural numbers and ≤ is the natural order on ω, is any linearly ordered set L = (ω,≤L) isomorphic to (ω,≤) such that ≤L is a computable relation. Let X be subset of ω and XL be the image of X in the linear order L under the isomorphism between (ω,≤) and L. The degree spectrum of X is the set of all Turing degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998